Evolutionary Algorithms in Approximate Computing: A Survey

نویسندگان

چکیده

In recent years, many design automation methods have been developed to routinely create approximate implementations of circuits and programs that show excellent trade-offs between the quality output required resources. This paper deals with evolutionary approximation as one popular methods. The provides first survey algorithm (EA)-based approaches applied in context computing. reveals EAs are primarily multi-objective optimizers. We propose divide these into two main classes: (i) parameter optimization which EA optimizes a vector system parameters, (ii) synthesis is responsible for determining architecture parameters resulting system. has at all levels abstraction different applications. neural search enabling automated hardware-aware deep networks was identified newly emerging topic this area.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Data Mining with Evolutionary Algorithms for Cloud Computing Application

With the rapid development of the internet, the amount of information and data which are produced, are extremely massive. Hence, client will be confused with huge amount of data, and it is difficult to understand which ones are useful. Data mining can overcome this problem. While data mining is using on cloud computing, it is reducing time of processing, energy usage and costs. As the speed of ...

متن کامل

efficient data mining with evolutionary algorithms for cloud computing application

with the rapid development of the internet, the amount of information and data which are produced, are extremely massive. hence, client will be confused with huge amount of data, and it is difficult to understand which ones are useful. data mining can overcome this problem. while data mining is using on cloud computing, it is reducing time of processing, energy usage and costs. as the speed of ...

متن کامل

Task Scheduling in Fog Computing: A Survey

Recently, fog computing has been introducedto solve the challenges of cloud computing regarding Internet objects. One of the challenges in the field of fog computing is the scheduling of tasks requested by Internet objects. In this study, a review of articles related to task scheduling in fog computing has been done. At first, the research questions and goals will be introduced, an...

متن کامل

Approximate Pareto Optimal Solutions of Multi objective Optimal Control Problems by Evolutionary Algorithms

In this paper an approach based on evolutionary algorithms to find Pareto optimal pair of state and control for multi-objective optimal control problems (MOOCP)'s is introduced‎. ‎In this approach‎, ‎first a discretized form of the time-control space is considered and then‎, ‎a piecewise linear control and a piecewise linear trajectory are obtained from the discretized time-control space using ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: JICS. Journal of integrated circuits and systems

سال: 2021

ISSN: ['1807-1953', '1872-0234']

DOI: https://doi.org/10.29292/jics.v16i2.499